sequence of exponents

См. также в других словарях:

• Highly composite number — This article is about numbers having many divisors. For numbers factorized only to powers of 2, 3, 5 and 7 (also named 7 smooth numbers), see Smooth number. A highly composite number (HCN) is a positive integer with more divisors than any… …   Wikipedia

• Equidistribution theorem — In mathematics, the equidistribution theorem is the statement that the sequence : a , 2 a , 3 a , ... mod 1 is uniformly distributed on the unit interval, when a is an irrational number. It is a special case of the ergodic theorem.clarify… …   Wikipedia

• Analytic continuation — In complex analysis, a branch of mathematics, analytic continuation is a technique to extend the domain of a given analytic function. Analytic continuation often succeeds in defining further values of a function, for example in a new region where …   Wikipedia

• Prime signature — The prime signature of a number is the sequence of exponents of its prime factorisation sorted in order of size.For example, all prime numbers have a prime signature of {1}, the squares of primes have a prime signature of {2}, the products of 2… …   Wikipedia

• Exponentiation — Exponent redirects here. For other uses, see Exponent (disambiguation). Exponentiation is a mathematical operation, written as an, involving two numbers, the base a and the exponent (or power) n. When n is a positive integer, exponentiation… …   Wikipedia

• mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… …   Universalium

• biblical literature — Introduction       four bodies of written works: the Old Testament writings according to the Hebrew canon; intertestamental works, including the Old Testament Apocrypha; the New Testament writings; and the New Testament Apocrypha.       The Old… …   Universalium

• Ordinal collapsing function — In mathematical logic and set theory, an ordinal collapsing function (or projection function) is a technique for defining (notations for) certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger …   Wikipedia

• Collatz conjecture — Directed graph showing the orbits of small numbers under the Collatz map. The Collatz conjecture is equivalent to the statement that all paths eventually lead to 1 …   Wikipedia

• KABBALAH — This entry is arranged according to the following outline: introduction general notes terms used for kabbalah the historical development of the kabbalah the early beginnings of mysticism and esotericism apocalyptic esotericism and merkabah… …   Encyclopedia of Judaism

• Large numbers — This article is about large numbers in the sense of numbers that are significantly larger than those ordinarily used in everyday life, for instance in simple counting or in monetary transactions. The term typically refers to large positive… …   Wikipedia